The equivalence of two classical list scheduling algorithms for dependent typed tasks with release dates, due dates and precedence delays
نویسندگان
چکیده
منابع مشابه
Preemptive Scheduling with Variable Profile, Precedence Constraints and Due Dates
This paper is concerned with the problem of scheduling preemptive tasks subject to precedence constraints in order to minimize the maximum lateness and the makespan. The number of available parallel processors is allowed to vary in time. It is shown that when an Earliest Due Date rst algorithm provides an optimal nonpreemptive schedule for unit-execution-time (UET) tasks, then the preemptive pr...
متن کاملAdjustments of Release and Due Dates for Cumulative Scheduling Problems
This paper presents a set of satisfiability tests and time-bound adjustments that can be applied to cumulative scheduling problems. We introduce the Cumulative Scheduling Problem (CuSP), an extension of the m-machine problem in which activities, having both release and due dates, can require more than one unit of the resource. Given a CuSP instance, we present two necessary conditions for the e...
متن کاملScheduling with Uncertain Release Dates
The aim of the paper is to examine whether we can adapt Bent and van Hentenryck’s combination methods to our problem, and to determine how effective and significant the methods are. In particular, we develop four ways of applying Bent and Van Hentenryck’s consensus approach[3] to our problem. In addition, since we assume the uncertainty distribution is known, we propose a probabilistic sampling...
متن کاملSingle-machine scheduling with release dates, due dates and family setup times
We address the NP-hard problem of scheduling n independent jobs with release dates, due dates, and family setup times on a single machine to minimize the maximum lateness. This problem arises from the constant tug-of-war going on in manufacturing between efficient production and delivery performance, between maximizing machine utilization by batching similar jobs and maximizing customers’ satis...
متن کاملSingle-machine scheduling with waiting-time-dependent due dates
We consider a single-machine scheduling problem in which due dates are linear functions of the job waiting-times and the objective is to minimize the maximum lateness. An optimal sequence is constructed by implementing an index-based priority rule for a fixed value of the due date normalizing constant k. We determine in polynomial time all the k value ranges so that the optimal sequence remains...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Scheduling
سال: 2017
ISSN: 1094-6136,1099-1425
DOI: 10.1007/s10951-016-0507-8